Axiomatizing complex algebras by games

Axiomatizing omplex algebras by games

Axiomatizing the Harsanyi solution, the symmetric egalitarian solution and the consistent solution for NTU-games

The validity of the axiomatization of the Harsanyi solution for NTU-games by Hart (1985) is shown to depend on the regularity conditions imposed on games. Following this observation, we propose two related axiomatic characterizations, one of the symmetric egalitarian solution (Kalai and Samet, 1985) and one of the consistent solution (Maschler and Owen, 1992). The three axiomatic results are st...

Axiomatizing Rationality

We provide a sound and complete axiomatization for a class of logics appropriate for reasoning about the rationality of players in games. Essentially the same axiomatization applies to a wide class of decision rules.

Some Remarks on Axiomatizing Logical Consequence Operations

In this paper we investigate the relation between the axiomatization of a given logical consequence operation and axiom systems defining the class of algebras related to that consequence operation. We show examples which prove that, in general there are no natural relation between both ways of axiomatization.

Axiomatizing core extensions

We give an axiomatization of the aspiration core on the domain of all TU-games using a relaxed feasibility condition, non-emptiness, individual rationality, and generalized versions of the reduced game property (consistency) and superadditivity. Our axioms also characterize the C-core ([Guesnerie and Oddou, 1979] and [Sun, Trockel, and Yang, 2008]) and the core on appropriate subdomains. The la...